Osculating Paths and Oscillating Tableaux
نویسندگان
چکیده
منابع مشابه
Osculating Paths and Oscillating Tableaux
The combinatorics of certain tuples of osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. The paths being considered have fixed start and end points on respectively the lower and right boundaries of a rectangle in the square lattice, each path can take only unit steps rightwards or upwards, and two different paths within a tuple are permitted to share...
متن کاملOsculating Lattice Paths and Alternating Sign Matrices
Osculating lattice paths are sets of directed lattice paths which are not allowed to cross or have common edges, but are allowed common vertices. We derive a constant term formula for the number of such lattice paths. The formula is obtained by solving a set of simultaneous recurrence relations. Alternating sign matrices are in simple bijection with a subset of osculating lattice paths. This le...
متن کاملDescent sets for oscillating tableaux
The descent set of an oscillating (or up-down) tableau is introduced. This descent set plays the same role in the representation theory of the symplectic groups as the descent set of a standard tableau plays in the representation theory of the general linear groups. In particular, we show that the descent set is preserved by Sundaram’s correspondence. This gives a direct combinatorial interpret...
متن کاملSkew Tableaux, Lattice Paths, and Bounded Partitions
We establish a one to one correspondence between a set of certain bounded partitions and a set of two-rowed standard Young tableaux of skew shape. Then we obtain a formula for a number which enumerates these partitions. We give two proofs for this formula, one by applying the above correspondence, the other by using the reflection principle. Finally, we give another expression for this number i...
متن کاملStandard Young tableaux and colored Motzkin paths
In this paper, we propose a notion of colored Motzkin paths and establish a bijection between the n-cell standard Young tableaux (SYT) of bounded height and the colored Motzkin paths of length n. This result not only gives a lattice path interpretation of the standard Young tableaux but also reveals an unexpected intrinsic relation between the set of SYTs with at most 2d+ 1 rows and the set of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2008
ISSN: 1077-8926
DOI: 10.37236/731